Fuzzy Automata as Coalgebras

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Automata as Coalgebras

Able to simultaneously encode discrete transitions and continuous behaviour, hybrid automata are the de facto framework for the formal specification and analysis of hybrid systems. The current paper revisits hybrid automata from a coalgebraic point of view. This allows to interpret them as state-based components, and provides a uniform theory to address variability in their definition, as well ...

متن کامل

Stream Automata Are Coalgebras

Stream automata (also called ω-automata) and ω-regular languages are of paramount importance in Computer Science and Logic. A coalgebraic treatment of these structures has not been given yet. We study a simple two-sorted setting where deterministic Muller automata can be cast as coalgebras, so that coalgebraic bisimilarity coincides with language equivalence. From this characterisation, we deri...

متن کامل

Weighted Automata as Coalgebras in Categories of Matrices

Received (Day Month Year) Accepted (Day Month Year) Communicated by (xxxxxxxxxx) The evolution from non-deterministic to weighted automata represents a shift from qualitative to quantitative methods in computer science. The trend calls for a language able to reconcile quantitative reasoning with formal logic and set theory, which have for so many years supported qualitative reasoning. Such a li...

متن کامل

Csp, Partial Automata, and Coalgebras | Draft |

Based on the theory of coalgebras the paper builds a bridge between CSP and au-tomata theory. We show that the concepts of processes in 4] coincide with the concepts of states for special, namely, nal partial automata. Moreover, we show how the deterministic and nondeterministic operations in 4] can be interpreted in a compatible way by constructions on the semantical level of automata. Especia...

متن کامل

Generalizing determinization from automata to coalgebras

The powerset construction is a standard method for converting a nondeterministic automaton into a deterministic one recognizing the same language. In this paper, we lift the powerset construction from automata to the more general framework of coalgebras with structured state spaces. Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An endofunctor ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2021

ISSN: 2227-7390

DOI: 10.3390/math9030272